Keyword-based access to relational data: To reproduce, or to not reproduce?
نویسندگان
چکیده
We investigate the problem of the reproducibility of keywordbased access systems to relational data. These systems address a challenging and important issue, i.e. letting users to access in natural language databases whose schema and instance are possibly unknown. However, neither there are shared implementations of state-of-the-art algorithms nor experimental results are easily replicable. We explore the difficulties in reproducing such systems and experimental results by implementing from scratch several state-of-the-art algorithms and testing them on shared datasets.
منابع مشابه
Multivariate geostatistical analysis: an application to ore body evaluation
It is now common in the mining industry to deal with several correlated attributes, which need to be jointly simulated in order to reproduce their correlations and assess the multivariate grade risk reasonably. Approaches to multivariate simulation which remove the correlation between attributes of interest prior to simulate and then re-impose the relationship afterward have been gaining popula...
متن کاملPnm-25: The Importance of Reproductive Health
a:4:{s:10:"Background";s:797:"Reproductive health is defined as a state of physical, mental, and social well-being in all matters relating to the reproductive system, at all stages of life. Good reproductive health implies that people are able to have a satisfying and safe sex life, the capability to reproduce and the freedom to decide if, when, and how often to do so. Men and women should be i...
متن کاملOn the reduction of the ordinary kriging smoothing effect
A simple but novel and applicable approach is proposed to solve the problem of smoothing effect of ordinary kriging estimate which is widely used in mining and earth sciences. It is based on transformation equation in which Z scores are derived from ordinary kriging estimates and then rescaled by the standard deviation of sample data and the sample mean is added to the result. It bears the grea...
متن کاملOn a security model of conjunctive keyword search over encrypted relational database
We study a security model for searching documents containing each of several keywords (conjunctive keyword search) over encrypted documents. A conjunctive keyword search protocol consists of three entities: a data supplier, a storage system such as database, and a user of storage system. A data supplier uploads encrypted documents on a storage system, and then a user of the storage system searc...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017